On Parent-Child Coding Gain in Zero-Tree Based Coders
نویسندگان
چکیده
We attempt to quantify the coding gain due to parent-child dependencies in subband transforms. These dependencies are generally credited for the excellent MSE performances of zero-tree based compression algorithms such as EZW and SPIHT. It is a simple matter to devise an experiment to remov e the ability of zero-tree coders to exploit the parent-child dependence. The goal is to prevent the treestructures from exhibiting spatial coherence, without disturbing the decaying spectrum property of the transform. T oachieve this goal, subbands are rotated b y 90 degrees with respect to the previous scale prior to zero-tree coding. Once zero-tree encoding and zero-tree decoding are performed, the subbands are rotated back to achieve the original orientation of each subband, prior to the inverse wav elettransform. This operation essentially destroys the parent-child dependencies in the treestructures. Thus, the resulting compression performance must be largely independent of parent-child relationships. We refer to the di erence between the \normal" and \rotated" compression performance as the parent-child coding gain, GPC . The av erageparent-child coding gain is plotted as a function of encoding rate for a set of 18 512 512 natural images in Figure 1. Results for both SPIHT with arithmetic coding (SPIHT-AC) and SPIHT without arithmetic coding (SPIHT-NC) are included. Results indicate that, for natural images, the parent-child coding gain is typically around 0.40 dB for SPIHT-NC, and 0.25 dB for SPIHT-AC. These numbers are substantially smaller than what is widely believed. Similarly, we hav e observed that if the rotation experiment is performed using integer wav elet transforms to enable lossless decompression, the lossless le sizes are largely unchanged.
منابع مشابه
ROI Coding with Integer Wavelet Transforms and Unbalanced Spatial Orientation Trees
--In this paper, we present region-based coding of medical images using integer wavelet transforms and the modified SPMT algorithm. Our method differs from previously reported region-ofinterest (ROI) coders in such a way that the regionbased integer wavelet transform is used to obtain the representation of the partitioned image plane rather than differentiating the coefficients associated with ...
متن کاملLow-Delay Speech Coding at 16 kb/s and Below
Development of network quality speech coders at 16 kb/s and below is an active research area. This thesis focuses on the study of low-delay Code Excited Linear Predictive (CELP) and tree coders. A 16 kb/s stochastic tree coder based on the (M,L) search algorithm suggested by Iyengar and Kabal and a low-delay CELP coder proposed by AT&T (CCITT 16 kb/s standardization candidate) are examined. The...
متن کاملEmbedded Image Coding Using ZeroBlocks of Subband/Wavelet Coefficients and Context Modeling
With fast computation and excellent compression efficiency, two embedded coding techniques, zero-tree/-block coding and context modeling of the subband/wavelet coefficients, have been widely utilized for image coding applications. In this research, we present a new embedded wavelet image coding algorithmwith an attempt to combine advantages of these two successful coding schemes. The experiment...
متن کاملCombining wavelet and fractal coding for 3-D video coding
Smooth regions and edges are very self similar and can be coded efficiently by fractal coders. One problem of fractal image coding is to achieve a high quality or a lossless representation of an image. This can be overcome by a hybrid coding approach as proposed by the authors in [3]. An extension to 3-D fractal video coding is described in [4]. Due to the block based algorithm, however, blocki...
متن کاملFast Progressive Wavelet Coding
Fast and efficient image compression can be achieved with the progressive wavelet coder (PWC) introduced in this paper. Unlike many previous wavelet coders, PWC does not rely on zerotrees or other ordering schemes based on parent-child wavelet relationships. PWC has a very simple structure, based on two key concepts: (1) data-independent reordering and blocking, and (2) lowcomplexity independen...
متن کامل